An Approach for Searching Unsupported Integer Solutions of the Bicriteria Network Flow Problem
نویسنده
چکیده
An approach for searching unsupported integer solutions of the bicriteria network flow problem is suggested. Some of the integer points in the triangles, defined by two neighbouring extreme nondominated points, are investigated by appropriately defined problems for a flow with one side constraint and for minimal cost flow.
منابع مشابه
On the Multicriteria Integer Network Flow Problem
The Pareto Optimal set for the multicriteria network flow problem is described by the theorem for ParetoOptimal flow augmenting paths. An approach for determining of the unsupported integer PO solutions of the investigated problem is proposed.
متن کاملA Mixed Integer Programming Approach to Optimal Feeder Routing for Tree-Based Distribution System: A Case Study
A genetic algorithm is proposed to optimize a tree-structured power distribution network considering optimal cable sizing. For minimizing the total cost of the network, a mixed-integer programming model is presented determining the optimal sizes of cables with minimized location-allocation cost. For designing the distribution lines in a power network, the primary factors must be considered as m...
متن کاملEnumeration of Dominant Solutions: An Application in Transport Network Design
A One-Dimensional Binary Integer Programming Problem (1DB-IPP) is concerned with selecting a subset from a set of k items in budget constraint to optimize an objective function. In this problem a dominant solution is defined as a feasible selection to which no further item could be added in budget constraint. This paper presents a simple algorithm for Enumeration of Dominant Solutions (EDS) and...
متن کاملA negative-cycle algorithm for computing all the supported efficient solutions in multi-objective integer network flow problems
This paper presents a new algorithm for identifying all the supported nondominated vectors (or outcomes) in the objective space, as well as the corresponding efficient solutions in the decision space, for the multi-objective integer network flow problem. Identifying the set of supported non-dominated vectors is of the utmost importance for obtaining a first approximation of the whole set of non...
متن کاملThe Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind of dynamic programming approach. The heuristics following this principle are often successful in practice. Their running time, however, depends on the number of enumerated solutions, which can be exponential in the worst case. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007